In this paper we address a topological approach to multiflow (multicommodityflow) problems in directed networks. Given a terminal weight $\mu$, we define ametrized polyhedral complex, called the directed tight span $T_{\mu}$, andprove that the dual of $\mu$-weighted maximum multiflow problem reduces to afacility location problem on $T_{\mu}$. Also, in case where the network isEulerian, it further reduces to a facility location problem on the tropicalpolytope spanned by $\mu$. By utilizing this duality, we establish theclassifications of terminal weights admitting combinatorial min-max relation(i) for every network and (ii) for every Eulerian network. Our result includesLomonosov-Frank theorem for directed free multiflows andIbaraki-Karzanov-Nagamochi's directed multiflow locking theorem as specialcases.
展开▼
机译:在本文中,我们解决了针对有向网络中的多流(multicommodityflow)问题的拓扑方法。给定终端权重$ \ mu $,我们定义了称为有向紧密跨度$ T _ {\ mu} $的磨光多面体复合体,并证明了加权的\\ mu $的对偶最大多流问题减少为$ T_上的设施位置问题{\ mu} $。而且,在网络是欧拉网络的情况下,它进一步简化为跨$ \ mu $的热带多面体上的设施位置问题。通过利用这种二元性,我们建立了允许组合最小-最大关系的终极权重的分类:(i)每个网络和(ii)每个欧拉网络。我们的结果包括有向自由多流的罗蒙诺索夫-弗兰克定理和特例的茨城-卡尔扎诺夫-纳莫莫的有向多流锁定定理。
展开▼